A Fast Procedure for Outlier Diagnostics in Large Regression Problems
نویسندگان
چکیده
منابع مشابه
Outlier Diagnostics in Logistic Regression: A Supervised Learning Technique
The goal of supervised learning is to build a concise model of the distribution of class labels in terms of predictor features. Logistic regression is one of the most popular supervised learning technique that is used in classification. Fields like computer vision, image analysis and engineering sciences frequently encounter data with outliers (noise). Presence of outliers in the training sampl...
متن کاملCURIO: A Fast Outlier and Outlier Cluster Detection Algorithm for Large Datasets
Outlier (or anomaly) detection is an important problem for many domains, including fraud detection, risk analysis, network intrusion and medical diagnosis, and the discovery of significant outliers is becoming an integral aspect of data mining. This paper presents CURIO, a novel algorithm that uses quantisation and implied distance metrics to provide a fast algorithm that is linear for the numb...
متن کاملA FAST FUZZY-TUNED MULTI-OBJECTIVE OPTIMIZATION FOR SIZING PROBLEMS
The most recent approaches of multi-objective optimization constitute application of meta-heuristic algorithms for which, parameter tuning is still a challenge. The present work hybridizes swarm intelligence with fuzzy operators to extend crisp values of the main control parameters into especial fuzzy sets that are constructed based on a number of prescribed facts. Such parameter-less particle ...
متن کاملA FAST GA-BASED METHOD FOR SOLVING TRUSS OPTIMIZATION PROBLEMS
Due to the complex structural issues and increasing number of design variables, a rather fast optimization algorithm to lead to a global swift convergence history without multiple attempts may be of major concern. Genetic Algorithm (GA) includes random numerical technique that is inspired by nature and is used to solve optimization problems. In this study, a novel GA method based on self-a...
متن کاملA fast swap-based local search procedure for location problems
We present a new implementation of a widely used swap-based local search procedure for the p-median problem, proposed in 1968 by Teitz and Bart. Our method produces the same output as the best alternatives described in the literature and, even though its worst-case complexity is similar, it can be significantly faster in practice: speedups of up to three orders of magnitude were observed. We al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the American Statistical Association
سال: 1999
ISSN: 0162-1459
DOI: 10.2307/2670164